منابع مشابه
Physarum can compute shortest paths
Physarum polycephalum is a slime mold that is apparently able to solve shortest path problems. A mathematical model has been proposed by Tero et al. (Journal of Theoretical Biology, 244, 2007, pp. 553-564) to describe the feedback mechanism used by the slime mold to adapt its tubular channels while foraging two food sources s(0) and s(1). We prove that, under this model, the mass of the mold wi...
متن کاملPhysarum Can Compute Shortest Paths: Convergence Proofs and Complexity Bounds
Physarum polycephalum is a slime mold that is apparently able to solve shortest path problems. A mathematical model for the slime’s behavior in the form of a coupled system of differential equations was proposed by Tero, Kobayashi and Nakagaki [TKN07]. We prove that a discretization of the model (Euler integration) computes a (1 + )approximation of the shortest path in O(mL(logn + logL)/ ) iter...
متن کاملPartial order approach to compute shortest paths in multimodal networks
Many networked systems involve multiple modes of transport. Such systems are called multimodal, and examples include logistic networks, biomedical phenomena, manufacturing process and telecommunication networks. Existing techniques for determining optimal paths in multimodal networks have either required heuristics or else application-specific constraints to obtain tractable problems, removing ...
متن کاملShortest paths between shortest paths
We study the following problem on recon guring shortest paths in graphs: Given two shortest st paths, what is the minimum number of steps required to transform one into the other, where each intermediate path must also be a shortest s-t path and must di er from the previous one by only one vertex. We prove that the shortest recon guration sequence can be exponential in the size of the graph and...
متن کاملShortest Paths between Shortest Paths and Independent Sets
We study problems of reconfiguration of shortest paths in graphs. We prove that the shortest reconfiguration sequence can be exponential in the size of the graph and that it is NP-hard to compute the shortest reconfiguration sequence even when we know that the sequence has polynomial length. Moreover, we also study reconfiguration of independent sets in three different models and analyze relati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Theoretical Biology
سال: 2012
ISSN: 0022-5193
DOI: 10.1016/j.jtbi.2012.06.017